The complexity of computing symmetric functions using threshold circuits
نویسندگان
چکیده
منابع مشابه
The Complexity of Computing Symmetric Functions Using Threshold Circuits
Beame, R., E. Brisson and R. Ladner, The complexity of computing symmetric functions using threshold circuits, Theoretical Computer Science 100 (1992) 2533265. This paper considers size-depth tradeoffs for threshold circuits computing symmetric functions. The size measure used is the number of connections or edges in the threshold circuits as opposed to the number of gates in the circuits. The ...
متن کاملEnergy-Efficient Threshold Circuits Computing Mod Functions
We prove that the modulus function MODm of n variables can be computed by a threshold circuit C of energy e and size s = O(e(n/m)1/(e−1)) for any integer e ≥ 2, where the energy e is defined to be the maximum number of gates outputting “1” over all inputs to C, and the size s to be the number of gates in C. Our upper bound on the size s almost matches the known lower bound s = Ω(e(n/m)1/e). We ...
متن کاملComputing threshold functions using dendrites
Neurons, modeled as linear threshold unit (LTU), can in theory compute all threshold functions. In practice, however, some of these functions require synaptic weights of arbitrary large precision. We show here that dendrites can alleviate this requirement. We introduce here the non-Linear Threshold Unit (nLTU) that integrates synaptic input sub-linearly within distinct subunits to take into acc...
متن کاملSize and Energy of Threshold Circuits Computing Mod Functions
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input x ∈ {0, 1}n to C is a multiple of m and, otherwise, C outputs “1.” The function MOD2 is the so-called PARITY function, and MODn+1 is the OR function. Let s be the size of the circuit C, that is, C consists of s threshold gates, and ...
متن کاملPolynomial Threshold Functions and Boolean Threshold Circuits
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90372-m